
@Comment = { selfheal.bib: Amitabh Trehan, March 15, 2010:
The references are organized according to the following Keys:
 - My papers
 - Algorithms, Data Structure
 - Algorithms, Distributed
 - Byzantine Networks
 - Computer Networks ( P2P) 
- Computer Networks (ad-hoc, wireless, sensor, complex, power-law, small-world) (this is a rather large set)
- Game theoretic
- Probability/Maths/Graph Theory
 - Self-*/Autonomic/Pervasive
 - Self-Healing
 - Social Networks
} 





@Comment = {Start my papers References}

@inproceedings{PanduranganPODC11,
 author = {Pandurangan, Gopal and Trehan, Amitabh},
 title = {Xheal: localized self-healing using expanders},
 booktitle = {Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing},
 series = {PODC '11},
 year = {2011},
 isbn = {978-1-4503-0719-2},
 location = {San Jose, California, USA},
 pages = {301--310},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/1993806.1993865},
 doi = {http://doi.acm.org/10.1145/1993806.1993865},
 acmid = {1993865},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {distributed, expanders, expansion, local, randomized, reconfiguration, self-healing, spectral properties},
}


@PHDTHESIS{Amitabh-2010-PhdThesis,
   AUTHOR = {Amitabh Trehan},
   TITLE = {{Algorithms for self-healing networks}},
   SCHOOL = {{University of New Mexico}},
   YEAR = {2010},
    isbn = {9781124067445},
    url={http://proquest.umi.com/pqdlink?did=2085415901&Fmt=2&clientI d=11910&RQT=309&VName=PQD},
    publisher={ProQuest},
   TYPE = {Dissertation}
}

@inproceedings{HayesPODC09,
 author = {Hayes, Thomas P. and Saia, Jared and Trehan, Amitabh},
 title = {The forgiving graph: a distributed data structure for low stretch under adversarial attack},
 booktitle = {PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computing},
 year = {2009},
 isbn = {978-1-60558-396-9},
 pages = {121--130},
 location = {Calgary, AB, Canada},
 doi = {http://doi.acm.org/10.1145/1582716.1582740},
 publisher = {ACM},
 address = {New York, NY, USA},
 }


@inproceedings{HayesPODC08,
 author = {Hayes,, Tom and Rustagi,, Navin and Saia,, Jared and Trehan,, Amitabh},
 title = {The forgiving tree: a self-healing distributed data structure},
 booktitle = {PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing},
 year = {2008},
 isbn = {978-1-59593-989-0},
 pages = {203--212},
 location = {Toronto, Canada},
 doi = {http://doi.acm.org/10.1145/1400751.1400779},
 publisher = {ACM},
 address = {New York, NY, USA},
 }


@inproceedings{SaiaTrehanIPDPS08,
  author    = {Jared Saia and Amitabh Trehan},
  title     = {Picking up the Pieces: Self-Healing in reconfigurable networks},
  booktitle = {IPDPS. 22nd IEEE International Symposium on Parallel and Distributed
               Processing.},
  year      = {2008},
  month={April},
  pages     = {1-12},
  ee        = {http://dx.doi.org/10.1109/IPDPS.2008.4536326},
  crossref  = {DBLP:conf/ipps/2008},
  keywords={degree based self-healing;network attack;network connectivity;network topology;power-law graph;reconfigurable network;telecommunication network topology;telecommunication security;},
 url={http://arxiv.org/pdf/0801.3710},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@proceedings{DBLP:conf/ipps/2008,
  title     = {22nd IEEE International Symposium on Parallel and Distributed
               Processing, IPDPS 2008, Miami, Florida USA, April 14-18,
               2008},
  booktitle = {IPDPS},
  publisher = {IEEE},
  year      = {2008},
  ISSN={1530-2075},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}




@Comment = {End my papers References}



@Comment = {Begin Algorithms, Data Structure references}

@article{AspnesS2007,
title="Skip graphs",
author="James Aspnes and Gauri Shah",
journal="ACM Transactions on Algorithms",
month=nov,
year=2007,
volume=3,
number=4,
pages={37}
}

 @inproceedings{Vaucher-Essays04,
  author    = {Jean G. Vaucher},
  title     = {Building Optimal Binary Search Trees from Sorted Values
               in {O}(N) Time},
  booktitle = {Essays in Memory of Ole-Johan Dahl},
  year      = {2004},
  pages     = {376-388},
  ee        = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=2635{\&}spage=376},
  crossref  = {DBLP:conf/birthday/2004dahl},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}


@inproceedings{Luby-STOC85,
 author = {M Luby},
 title = {A simple parallel algorithm for the maximal independent set problem},
 booktitle = {STOC '85: Proceedings of the seventeenth annual ACM symposium on Theory of computing},
 year = {1985},
 isbn = {0-89791-151-2},
 pages = {1--10},
 location = {Providence, Rhode Island, United States},
 doi = {http://doi.acm.org/10.1145/22145.22146},
 publisher = {ACM},
 address = {New York, NY, USA},
 }
 
 @book{CLRS,
   title = {Introduction to Algorithms}, 
   author = {Thomas H. Cormen and Charles E. Leiserson and Ronald L.
      Rivest and Clifford Stein}, 
   year = {2001}, 
   edition = {second}, 
   publisher = {McGraw-Hill}, 
   www_section = {default}, 
   www_html_url = {http://theory.lcs.mit.edu/~clr/}, 
}

@article{ medard99redundant,
   author = "Muriel Medard and Steven G. Finn and Richard A. Barry",
   title = "Redundant trees for preplanned recovery in arbitrary
vertex-redundant or edge-redundant graphs",
   journal = "IEEE/ACM Transactions on Networking",
   volume = "7",
   number = "5",
   pages = "641-652",
   year = "1999",
   url = "citeseer.ist.psu.edu/medard99redundant.html"
}


@article{newman-2001-64,
   author = {M E J Newman and S H Strogatz and D J Watts},
   title = {Random graphs with arbitrary degree distributions and their
applications},
   journal = {Physical Review E},
   volume = {64},
   pages = {026118},
   url = {http://www.citebase.org/cgi-bin/citations?id=oai:arXiv.org:cond-mat/0007235},
   year = {2001}
}


@inproceedings{Cohen,
  author = {Edith Cohen},
  title = {Size-Estimation Framework with Applications to Transitive Closure and Reachability},
  booktitle = {Proceedings of the Foundations of Computer Science (FOCS)},
    year = {1994}
 }

 
@Comment = {End Algorithms, Data Structure references}

@Comment = {Begin Algorithms, Distributed references}

@book{peleg,
   title = {Distributed Computing: A Locality Sensitive Approach}, 
   author = {David Peleg}, 
   year = {2000},  
   publisher = {SIAM} 
}


@book{GerardTelDistributedAlgosBook,
 author = {Tel, Gerard},
 title = {Introduction to distributed algorithms},
 year = {1994},
 isbn = {0-521-47096-2},
 publisher = {Cambridge University Press},
 address = {New York, NY, USA},
 }
 
 @inproceedings{HillelPODC10,
 author = {Hayes, Thomas P. and Saia, Jared and Trehan, Amitabh},
 title = {Partial Information Spreading with Application to Distributed Maximum Coverage},
 booktitle = {PODC '10: Proceedings of the 28th ACM symposium on Principles of distributed computing},
 year = {2010},
 location = {Zurich, Switzerland},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@inproceedings{lawsiu,
    author = {Law, C. and Siu, K. Y.},
    booktitle = {INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE},
    citeulike-article-id = {3169868},
    citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=1209234},
    journal = {INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE},
    keywords = {expanders, networks, p2p, random-graphs, random-walks},
    pages = {2133--2143 vol.3},
    posted-at = {2008-08-28 16:21:51},
    priority = {3},
    title = {{Distributed construction of random expander networks}},
    url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=1209234},
    volume = {3},
    year = {2003}
    
}

@article{friedman,
author = {J. Friedman},
title = {On the second eigenvalue and random walks in random
d-regular graphs},
 journal = {Combinatorica},
 volume = {11},
 pages =  {331362},
 year = {1991}
 }
 
 @inproceedings{drw1,
  author    = {Atish {Das Sarma} and
               Danupon Nanongkai and
               Gopal Pandurangan},
  title     = {Fast distributed random walks},
  booktitle = {PODC},
  year      = {2009},
  pages     = {161-170}}

@inproceedings{drw2,
  author    = {Atish {Das Sarma} and
               Danupon Nanongkai and
               Gopal Pandurangan and
               Prasad Tetali},
  title     = {Efficient Distributed Random Walks with Applications},
  booktitle = {PODC},
  year      = {2010}
}

@article{mihail-p2p,  
author =   {C. Gkantsidis and  M. Mihail and A. Saberi},
  title =    {Random Walks in Peer-to-Peer Networks: Algorithms and Evaluation},
  booktitle =    {Performance Evaluation},
  year =     {2006},
  volume = {63(3)},
  pages = {241-263}
}

@InProceedings{mihail,
  author =   {C. Gkantsidis and G. Goel and M. Mihail and A. Saberi},
  title =    {Towards Topology Aware Networks},
  booktitle =    {IEEE INFOCOM},
  year =     {2007}
}

@Comment = {End Algorithms, Distributed references}

@Comment = {Begin Byzantine Agreement references}

@Misc{KingSaia10BreakingBarrierArxiv,
author = {Valerie King and Jared Saia},
title = {Breaking the O($n^2$) Bit Barrier: Scalable Byzantine agreement with an Adaptive Adversary},
year = {2010},
note = {http://arxiv.org/abs/1002.4561}
}

@inproceedings{KingSDISC09,
  author    = {Valerie King and
               Jared Saia},
  title     = {From Almost Everywhere to Everywhere: Byzantine Agreement
               with {\~O}(n$^{\mbox{3/2}}$) Bits},
  booktitle = {DISC},
  year      = {2009},
  pages     = {464-478},
  ee        = {http://dx.doi.org/10.1007/978-3-642-04355-0\_47},
  crossref  = {DBLP:conf/wdag/2009},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{KKKSSSODA08,
 author = {Kapron, Bruce and Kempe, David and King, Valerie and Saia, Jared and Sanwalani, Vishal},
 title = {Fast asynchronous byzantine agreement and leader election with full information},
 booktitle = {SODA '08: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms},
 year = {2008},
 pages = {1038--1047},
 location = {San Francisco, California},
 publisher = {Society for Industrial and Applied Mathematics},
 address = {Philadelphia, PA, USA},
 }

@Comment = {End Byzantine Agreement references}


@Comment = {Begin Computer Networks (P2P) references}

@INPROCEEDINGS{Karthik03loadbalancing,
    author = {Ananth Rao Karthik and Ananth Rao and Karthik Lakshminarayanan and Sonesh Surana and Richard Karp and Ion Stoica},
    title = {Load Balancing in Structured P2P Systems},
    booktitle = {2nd International Workshop on Peer-To-Peer Systems (IPTPS)},
    year = {2003}
}

@InProceedings{Kuhn2006Blueprint,
author = {Fabian Kuhn and Stefan Schmid and Joest Smit and Roger Wattenhofer},
title = {{A Blueprint for Constructing Peer-to-Peer Systems Robust to Dynamic Worst-Case Joins and Leaves}},
booktitle = {{14th IEEE International Workshop on Quality of Service (IWQoS), Yale University, New Haven, Connectitut, USA}},
month = {June},
year = {2006}
}
@InProceedings{Kuhn2005Self-Repairing,
author = {Fabian Kuhn and Stefan Schmid and Roger Wattenhofer},
title = {{A Self-Repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn}},
booktitle = {{4th International Workshop on Peer-To-Peer Systems (IPTPS), Cornell University, Ithaca, New York, USA, Springer LNCS 3640}},
month = {February},
year = {2005}
}

@inproceedings{MNW,
  author = {Gurmeet Singh Manku and Moni Naor and Udi Wieder},
  title = {Know thy Neighbor's Neighbor: the Power of Lookahead in Randomized P2P
    Networks},
  booktitle = {Proceedings of the 36th ACM Symposium on Theory of Computing (STOC)},
    year = {2004}
 }
 
 @article{Stoica03Chord,
 author = {Stoica, Ion and Morris, Robert and Liben-Nowell, David and Karger, David R. and Kaashoek, M. Frans and Dabek, Frank and Balakrishnan, Hari},
 title = {Chord: a scalable peer-to-peer lookup protocol for internet applications},
 journal = {IEEE/ACM Trans. Netw.},
 volume = {11},
 number = {1},
 year = {2003},
 issn = {1063-6692},
 pages = {17--32},
 doi = {http://dx.doi.org/10.1109/TNET.2002.808407},
 publisher = {IEEE Press},
 address = {Piscataway, NJ, USA},
 }


@Comment = {End Computer Networks (P2P) references}


@Comment = {Begin Computer Networks (ad-hoc, wireless, sensor, complex, power-law) references}

@inproceedings{Kleinberg00SmallWorld,
 author = {Kleinberg, Jon},
 title = {The small-world phenomenon: an algorithm perspective},
 booktitle = {STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing},
 year = {2000},
 isbn = {1-58113-184-4},
 pages = {163--170},
 location = {Portland, Oregon, United States},
 doi = {http://doi.acm.org/10.1145/335305.335325},
 publisher = {ACM},
 address = {New York, NY, USA},
 }


 @INPROCEEDINGS{Naor04knowthy,
    author = {Moni Naor and Udi Wieder},
    title = {Know thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds},
    booktitle = {in Proc. of IPTPS, 2004},
    year = {2004},
    pages = {269--277}
}

@inproceedings{wang03integrated,
   author = {Xiaorui Wang and Guoliang Xing and Yuanfang Zhang and
Chenyang Lu and Robert Pless and Christopher Gill},
   title = {Integrated coverage and connectivity configuration in
wireless sensor networks},
   booktitle = {SenSys '03: Proceedings of the 1st international
conference on Embedded networked sensor systems},
   year = {2003},
   isbn = {1-58113-707-9},
   pages = {28--39},
   location = {Los Angeles, California, USA},
   doi = {http://doi.acm.org/10.1145/958491.958496},
   publisher = {ACM Press},
   address = {New York, NY, USA},
}

@INPROCEEDINGS{Huang02topologycontrol,
    author = {Zhuochuan Huang and Chien-chung Shen and Chavalit Srisathapornphat and Chaiporn Jaikaeo},
    title = {Topology Control for Ad hoc Networks with Directional Antennas},
    booktitle = {Proc. IEEE Int. Conference on Computer Communications and Networks},
    year = {2002},
    pages = {16--21}
}

@article{goel04resilient,
   author = "Sanjay Goel and Salvatore Belardo and Laura Iwan",
   title = "A Resilient Network that Can Operate Under Duress: To Support
      Communication between Government Agencies during Crisis Situations",
   year = "2004",
   journal = "Proceedings of the 37th Hawaii International Conference on
      System Sciences",
   volume = "0-7695-2056-1/04",
   pages = "1-11" 
}

 @inproceedings{thite-percom06,
 author = {Christopher L. Barrett and V. S.  Anil Kumar and Madhav V. Marathe and Shripad Thite and Gabriel Istrate},
 title = {Strong Edge Coloring for Channel Assignment in Wireless Radio Networks},
 booktitle = {PERCOMW '06: Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops},
 year = {2006},
 isbn = {0-7695-2520-2},
 pages = {106},
 doi = {http://dx.doi.org/10.1109/PERCOMW.2006.129},
 publisher = {IEEE Computer Society},
 address = {Washington, DC, USA},
 }

@inproceedings{513811,
   author = {Christian Bettstetter},
   title = {On the minimum node degree and connectivity of a wireless
multihop network},
   booktitle = {MobiHoc '02: Proceedings of the 3rd ACM international
symposium on Mobile ad hoc networking \& computing},
   year = {2002},
   isbn = {1-58113-501-7},
   pages = {80--91},
   location = {Lausanne, Switzerland},
   doi = {http://doi.acm.org/10.1145/513800.513811},
   publisher = {ACM Press},
   address = {New York, NY, USA},
}

@inproceedings{ david01resilient,
   author = "David G. Andersen and Hari Balakrishnan and M. Frans
Kaashoek and Robert Morris",
   title = "Resilient Overlay Networks",
   booktitle = "Symposium on Operating Systems Principles",
   pages = "131-145",
   year = "2001",
   url ="citeseer.ist.psu.edu/andersen01resilient.html"
}

@inproceedings{dekkerRobustness, 
   author = "A. H. Dekker and B. Colbert",
   title = "Scale-Free Networks and Robustness of Critical Infrastructure
      Networks",
   booktitle = "Proceedings of the 7^th Asia-Pacific Conference on Complex
      Systems",
   pages = "685-699",
   year = "2004",
   url = "http://scholar.google.com/url?sa=U&q=http://members.ozemail.com.au/~dekker/Dekker.Colbert.Cairns.pdf"
}

@article{anderson01RON,
   author = {David Andersen and Hari Balakrishnan and Frans Kaashoek and
       Robert Morris},
   title = {Resilient overlay networks},
   journal = {SIGOPS Oper. Syst. Rev.},
   volume = {35},
   number = {5},
   year = {2001},
   issn = {0163-5980},
   pages = {131--145},
   doi = {http://doi.acm.org/10.1145/502059.502048},
   publisher = {ACM Press},
   address = {New York, NY, USA},
}


@inproceedings{AwerbuchAdapt92,
 author = {Awerbuch,, Baruch and Patt-Shamir,, Boaz and Peleg,, David and Saks,, Michael},
 title = {Adapting to asynchronous dynamic networks (extended abstract)},
 booktitle = {STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing},
 year = {1992},
 isbn = {0-89791-511-9},
 pages = {557--570},
 location = {Victoria, British Columbia, Canada},
 doi = {http://doi.acm.org/10.1145/129712.129767},
 publisher = {ACM},
 address = {New York, NY, USA},
 }


@inproceedings{ murakami97comparative,
   author = "Kazutaka Murakami and Hyong S. Kim",
   title = "Comparative Study on Restoration Schemes of Survivable
{ATM} Networks",
   booktitle = "{INFOCOM} (1)",
   pages = "345-352",
   year = "1997",
   url = "citeseer.ist.psu.edu/murakami97comparative.html"
}

@article{xiong99restore,
   author = {Yijun Xiong and Lorne G. Mason},
   title = {Restoration strategies and spare capacity requirements in
self-healing {ATM} networks},
   journal = {IEEE/ACM Trans. Netw.},
   volume = {7},
   number = {1},
   year = {1999},
   issn = {1063-6692},
   pages = {98--110},
   doi = {http://dx.doi.org/10.1109/90.759330},
   publisher = {IEEE Press},
   address = {Piscataway, NJ, USA},
}

@article{iraschko98capacity,
   author = {Rainer R. Iraschko and M. H. MacGregor and Wayne D. Grover},
   title = {Optimal capacity placement for path restoration in {STM} or {ATM}
mesh-survivable networks},
   journal = {IEEE/ACM Trans. Netw.},
   volume = {6},
   number = {3},
   year = {1998},
   issn = {1063-6692},
   pages = {325--336},
   doi = {http://dx.doi.org/10.1109/90.700896},
   publisher = {IEEE Press},
   address = {Piscataway, NJ, USA},
}

@article{doverspike94capacity,
   author    = {Robert D. Doverspike and Brian Wilson},
   title     = {Comparison of Capacity Efficiency of DCS Network Restoration
Routing Techniques.},
   journal   = {J. Network Syst. Manage.},
   volume    = {2},
   number    = {2},
   year      = {1994},
   ee        = {http://www.cstp.umkc.edu/jnsm/vols/vol02\_abs/02-2-doverspike.html},
   bibsource = {DBLP, http://dblp.uni-trier.de}
}

@inproceedings{caenegem97capacity,
   author = {B. van Caenegem and N. Wauters and P. Demeester},
   title = {Spare capacity assignment for different restoration strategies
      in mesh survivable networks},
   booktitle = {Communications, 1997. ICC 97 Montreal, 'Towards the
      Knowledge Millennium'. 1997 IEEE International Conference on},
   volume = {1},
   pages = {288-292},
   year = {1997},
   url =
   {http://ieeexplore.ieee.org/xpl/freeabs\_all.jsp?isnumber=13277&arnumber=605255&count=107&index=56}
}

@inproceedings{frisanco97capacity,
   author = {Frisanco, T.},
   title = {Optimal spare capacity design for various protection
      switching methods in {ATM} networks},
   booktitle = {Communications, 1997. ICC 97 Montreal, 'Towards the
      Knowledge Millennium'. 1997 IEEE International Conference on},
   volume = {1},
   pages = {293-298},
   year = {1997},
   url =
   {http://ieeexplore.ieee.org/xpl/freeabs\_all.jsp?isnumber=13277&arnumber=605267&count=107&index=57}
}

@article{cascade1,
   author = "Adilson E. Motter and Ying-Cheng Lai",
   title = "Cascade-based attacks on complex networks",
   year = "2002",
   journal = "Physical Review E",
   volume = "66",
   number = "065102(R)",
   pages = "1-4"
}

@article{barabasi-1999-286,
   author = {Albert-Laszlo Barabasi and Reka Albert},
   title = {Emergence of scaling in random networks},
   journal = {Science},
   volume = {286},
   pages = {509},
   url = {http://www.citebase.org/cgi-bin/citations?id=oai:arXiv.org:cond-mat/9910332},
   year = {1999}
}

@article{barabasi-2003-50,
   author = {Albert-L\'{a}szl\'{o} Barab\'{a}si and Eric Bonabeau},
   title = {Scale-Free Networks},
   journal = {Scientific American},
   volumne = {288},
   pages = {50-59},
   url =
   {http://www.nd.edu/~networks/Publication\ Categories/01\ 20Review\ Articles/ScaleFree\_Scientific\ Ameri\ 0288,\ 60-69\ (2003).pdf},
   year = {2003}
}

@article{albert-2000-406,
   author = {Reka Albert and Hawoong Jeong and Albert-Laszlo Barabasi},
   title = {Error and attack tolerance of complex networks},
   journal = {Nature},
   volume = {406},
   pages = {378},
   url = {http://www.citebase.org/cgi-bin/citations?id=oai:arXiv.org:cond-mat/0008064},
   year = {2000}
}


@article{motter-2002-66,
   author = {Adilson E Motter and Ying-Cheng Lai},
   title = {Cascade-based attacks on complex networks},
   journal = {Physical Review E},
   volume = {66},
   pages = {065102},
   url = {http://www.citebase.org/cgi-bin/citations?id=oai:arXiv.org:cond-mat/0301086},
   year = {2002}
}

@article{motter-2004-93,
   author = {Adilson E Motter},
   title = {Cascade control and defense in complex networks},
   journal = {Physical Review Letters},
   volume = {93},
   pages = {098701},
   url = {doi:10.1103/PhysRevLett.93.098701},
   year = {2004}
}

@misc{hayashi2005,
   author = {Yukio Hayashi and Toshiyuki Miyazaki},
   title = {Emergent rewirings for cascades on correlated networks},
   howpublished = {cond-mat/0503615},
   url = {http://www.citebase.org/cgi-bin/citations?id=oai:arXiv.org:cond-mat/0503615},
   year = {2005}
}

@article{holme-2002-65,
   author = {Petter Holme and Beom Jun Kim},
   title = {Vertex overload breakdown in evolving networks},
   journal = {Physical Review E},
   volume = {65},
   pages = {066109},
   url = {http://www.citebase.org/cgi-bin/citations?id=oai:arXiv.org:cond-mat/0204120},
   year = {2002}
}


@misc{and-sscada,
   author = {Yongge Wang and Bei-Tseng Chu },
   title = {sSCADA: Securing SCADA Infrastructure Communications},
   howpublished = {Cryptology ePrint Archive, Report 2004/265},
   year = {2004},
   note = {url{http://eprint.iacr.org/}},
}




@Misc{garvey,
  title={{What happened on August 16}},
  author = {Villu Arak},
  note={http://heartbeat.skype.com/2007/08/what-happened-on-august-16.html},
  month = {August},
  year = {2007}
}

@Misc{stone,
  title={{Skype: Microsoft Update Took Us Down}},
  author = {Brad Stone},
  note={http://bits.blogs.nytimes.com/2007/08/20/skype-microsoft-update-took-us-down},
  month = {August},
  year = {2007}
}


@Misc{ray,
  title={{Skype hangs up on users}},
  author = {Bill Ray},
  note={http://www.theregister.co.uk/2007/08/16/skype\_down/},
  month = {August},
  year = {2007}
}

@Misc{malik,
  title={{Does Skype Outage Expose P2Ps Limitations?}},
  author = {Om Malik},
  note={http://gigaom.com/2007/08/16/skype-outage},
  month = {August},
  year = {2007}
}

@Misc{fisher,
  title={{Skype talks of "perfect storm" that caused outage, clarifies blame}},
  author = {Ken Fisher},
  note={http://arstechnica.com/news.ars/post/20070821-skype-talks-of-perfect-storm.html},
  month = {August},
  year = {2007}
}

@Misc{moore,
  title={{Skype's outage not a hang-up for user base}},
  author = {Matt Moore},
  note={http://www.usatoday.com/tech/wireless/phones/2007-08-24-skype-outage-effects-N.htm},
  month = {August},
  year = {2007}
}

@Comment = {End Computer Networks (ad-hoc, wireless, sensor, complex, power-law) references}


@Comment = {Begin Game Theoretic references}

@inproceedings{FLMPSPODC03,
 author = {Fabrikant, Alex and Luthra, Ankur and Maneva, Elitza and Papadimitriou, Christos H. and Shenker, Scott},
 title = {On a network creation game},
 booktitle = {PODC '03: Proceedings of the twenty-second annual symposium on Principles of distributed computing},
 year = {2003},
 isbn = {1-58113-708-7},
 pages = {347--351},
 location = {Boston, Massachusetts},
 doi = {http://doi.acm.org/10.1145/872035.872088},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@TechReport{Kets-Minority2007,
  author={Kets, W. and Voorneveld, M.},
  title={Congestion, Equilibrium and Learning: The Minority Game},
  year=2007,
  institution={Tilburg University, Center for Economic Research},
  type={Discussion Paper},
  url={http://ideas.repec.org/p/dgr/kubcen/200761.html},
  number={2007-61}
}

@Comment ={End Game Theoretic references}


@Comment = {Begin Probability/Maths/Graph Theory references}

@article{Wigderson-exsurvey,
    author = {Hoory, Shlomo and Linial, Nathan and Wigderson, Avi},
    citeulike-article-id = {7032643},
    citeulike-linkout-0 = {http://dx.doi.org/10.1090/S0273-0979-06-01126-8},
    citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0273097906011268},
    doi = {10.1090/S0273-0979-06-01126-8},
    issn = {0273-0979},
    journal = {Bulletin of the American Mathematical Society},
    keywords = {expanders},
    month = {August},
    number = {04},
    pages = {439--562},
    posted-at = {2010-04-18 17:17:48},
    priority = {2},
    title = {{Expander graphs and their applications}},
    url = {http://dx.doi.org/10.1090/S0273-0979-06-01126-8},
    volume = {43},
    year = {2006}
}

@book{chungbook,
   title = {Spectral Graph Theory}, 
   author = {Fan Chung}, 
   year = {1997},  
   publisher = {American Mathematical Society} 
}


@article{Glick-RecordBreaking78,
title = {Breaking Records and Breaking Boards}, 
author = {Ned Glick},
journal = {The American Mathematical Monthly},
volume =  "85", 
number =  "1",
month = "January",
year =  "1978",
pages =  "2-26"
}

@Comment = {End Probability/Maths/Graph Theory references}

@Comment = {Start Self-*/Autonomic/Pervasive References}

@article{Djikstra74SelfStabilizing,
    author = {Dijkstra, Edsger W.},
    citeulike-article-id = {131327},
    citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=361179.361202},
    citeulike-linkout-1 = {http://dx.doi.org/10.1145/361179.361202},
    doi = {10.1145/361179.361202},
    issn = {0001-0782},
    journal = {Commun. ACM},
    keywords = {classic, distributedsystems},
    month = {November},
    number = {11},
    pages = {643--644},
    posted-at = {2008-03-12 12:50:02},
    priority = {2},
    publisher = {ACM Press},
    title = {Self-stabilizing systems in spite of distributed control},
    url = {http://dx.doi.org/10.1145/361179.361202},
    volume = {17},
    year = {1974}
}



@article{Berns09DissectingSelf-*,
author = {Andrew Berns and Sukumar Ghosh},
title = {Dissecting Self-* Properties},
journal ={Self-Adaptive and Self-Organizing Systems, International Conference on},
volume = {0},
isbn = {978-0-7695-3794-8},
year = {2009},
pages = {10-19},
doi = {http://doi.ieeecomputersociety.org/10.1109/SASO.2009.25},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}

@Misc{IBMAutonomicManifesto,
article={Autonomic computing: IBM's perspective on the state of information technology},
author={IBM},
note={http://www.research.ibm.com/autonomic/manifesto/autonomic computing.pdf}
}

@Misc{IBMAutonomicVision,
article={The Vision of Autonomic Computing},
author={IBM},
note={http://www.research.ibm.com/autonomic/research/papers/AC\_Vision\\ \_Computer\_Jan\_2003.pdf}
}

@Misc{Whatis?AutonomicComputing,
article={What is autonomic computing?},
author={Whatis.com},
note = {http://searchcio-midmarket.techtarget.com/sDefinition/0,,sid183\\ \_gci906565,00.html}
}

@article{Dolev09EmpireofColoniesSelf-stabilizing,
 author = {Dolev, Shlomi and Tzachar, Nir},
 title = {Empire of colonies: Self-stabilizing and self-organizing distributed algorithm},
 journal = {Theor. Comput. Sci.},
 volume = {410},
 number = {6-7},
 year = {2009},
 issn = {0304-3975},
 pages = {514--532},
 doi = {http://dx.doi.org/10.1016/j.tcs.2008.10.006},
 publisher = {Elsevier Science Publishers Ltd.},
 address = {Essex, UK}
 }

@book{DolevBookSelfStabilization,
 author = {Dolev, Shlomi},
 title = {Self-stabilization},
 year = {2000},
 isbn = {0-262-04178-2},
 publisher = {MIT Press},
 address = {Cambridge, MA, USA}
 }

@Comment = {End Self-*/Autonomic/Pervasive References}

@Comment = {Begin Self-Healing References}

@inproceedings{BomanSAS06,
title = {Brief Announcement: Self-healing Algorithms for Reconfigurable Networks.},
author = {Iching Boman and Jared Saia and Chaouki T. Abdallah and Edl Schamiloglu},
booktitle = {Symposium on Stabilization, Safety, and Security of Distributed Systems(SSS)},
year = {2006}
}

@article{IchingThesis,
author = "I-Ching C. Boman",
title = "Algorithms for Self-Healing Networks",
year = "2006",
journal = "M.S. Thesis, Computer Science, University of New Mexico."
}

@article{aminEnergy,
   author = "Amin, M.",
   title = "Towards Self-Healing Energy Infrastructure Systems",
   year = "2001",
   journal = "IEEE Computer Applications in Power",
   volume = "14",
   issue = "1",
   pages = "20-28" 
}

@article{Branch07SelfHealingRouting,
author = "J.W. Branch, M. Lisee and B.K. Szymanski",
title = "SHR: self-healing routing for wireless ad hoc sensor networks",
journal =" Proc. Int. Symposium on Performance Evaluation of Computer and Telecommunication Systems SPECTS'07",
year = "2007", 
pages =  "5-14"
}

@article{Ghosh07Self-healingSystemsSurvey,
 author = {Ghosh, Debanjan and Sharman, Raj and Raghav Rao, H. and Upadhyaya, Shambhu},
 title = {Self-healing systems - survey and synthesis},
 journal = {Decis. Support Syst.},
 volume = {42},
 number = {4},
 year = {2007},
 issn = {0167-9236},
 pages = {2164--2185},
 doi = {http://dx.doi.org/10.1016/j.dss.2006.06.011},
 publisher = {Elsevier Science Publishers B. V.},
 address = {Amsterdam, The Netherlands, The Netherlands},
 }

@inproceedings{Meyer08Self-healingMultipathRouting,
 author = {Meyer, Thomas and Yamamoto, Lidia and Tschudin, Christian},
 title = {A self-healing multipath routing protocol},
 booktitle = {BIONETICS '08: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems},
 year = {2008},
 isbn = {978-963-9799-35-6},
 pages = {1--8},
 location = {Hyogo, Japan},
 publisher = {ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)},
 address = {ICST, Brussels, Belgium, Belgium},
 }


 @INPROCEEDINGS{Gui03short:self-healing,
    author = {Chao Gui and Prasant Mohapatra},
    title = {SHORT: self-healing and optimizing routing techniques for mobile ad hoc networks},
    booktitle = {In Proceedings of MobiHoc},
    year = {2003},
    pages = {279--290},
    publisher = {ACM Press}
}

@Comment = {End Self-Healing References}



@Comment ={Begin Social Networks  references}

@inproceedings{LSSTOC09,
 author = {Lattanzi, Silvio and Sivakumar, D.},
 title = {Affiliation networks},
 booktitle = {STOC '09: Proceedings of the 41st annual ACM symposium on Theory of computing},
 year = {2009},
 isbn = {978-1-60558-506-2},
 pages = {427--434},
 location = {Bethesda, MD, USA},
 doi = {http://doi.acm.org/10.1145/1536414.1536474},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@inproceedings{TantiSIGKDD07,
 author = {Tantipathananandh, Chayant and Berger-Wolf, Tanya and Kempe, David},
 title = {A framework for community identification in dynamic social networks},
 booktitle = {KDD '07: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining},
 year = {2007},
 isbn = {978-1-59593-609-7},
 pages = {717--726},
 location = {San Jose, California, USA},
 doi = {http://doi.acm.org/10.1145/1281192.1281269},
 publisher = {ACM},
 address = {New York, NY, USA},
 }

@inproceedings{TanyaJaredKDD06,
 author = {Berger-Wolf, Tanya Y. and Saia, Jared},
 title = {A framework for analysis of dynamic social networks},
 booktitle = {KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining},
 year = {2006},
 isbn = {1-59593-339-5},
 pages = {523--528},
 location = {Philadelphia, PA, USA},
 doi = {http://doi.acm.org/10.1145/1150402.1150462},
 publisher = {ACM},
 address = {New York, NY, USA},
 }


@Misc{TanyaZebraScienceNews,
title= {Social Networking for Zebras},
author = {Julie Rehmeyer},
note = {http://www.sciencenews.org/view/generic/id/9150/title/Math\_Trek\_Social\\ \_Networking\_for\_Zebras}
}

@Misc{MITRealityDataSet,
title = {The Reality Mining Dataset},
author = {MIT Media Lab},
note = {http://reality.media.mit.edu/dataset.php}
} 

@Comment ={End Social Networks references}

@techreport{G84,
    Author = {Goldberg, A. V.},
    Title = {Finding a Maximum Density Subgraph},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1984},
    Number = {UCB/CSD-84-171}
}


@inproceedings{LLT,
  
author    = {Theodoros Lappas and
 Kun Liu and Evimaria Terzi},
title     = {Finding a team of experts in social networks},
  booktitle = {KDD},

year      = {2009},
 
pages     = {467-476}

}




@inproceedings{KS,
author    = {Samir Khuller and Barna Saha},
title     = {On Finding Dense Subgraphs},
  
booktitle = {ICALP (1)},
  
year      = {2009},
  
pages     = {597-608}

}



@article{CL,
author = {S. J. Chen and L. Lin},
title = {Modeling team member characteristics for the formation of a multifunctional team in concurrent engineering},
journal = {IEEE Transactions on Engineering Management},
volume = {51},
number = {2},
year = {2004},
pages = {111-124}
}

@article{ZK,
author = {A. Zakarian and A. Kusiak},
title = {Forming teams: an analytical approach},
journal = {IIE Transactions},
volume = {31},
number = {1},
year = {2004},
pages = {85-97}
}

@article{BDD,
author = {Adil Baykasoglu and Turkay Dereli and Sena Das},
title = {Project Team Selection Using Fuzzy Optimization Approach},
journal = {Cybern. Syst.},
volume = {38},
number = {2},
year = {2007},
pages = {155-185}
}


@article{FA,
 author = {F. L. Fitzpatrick and R. G. Askin},
 title = {Forming effective worker teams with multi-functional skill requirements},
 journal = {Comput. Ind. Eng.},
 volume = {48},
 number = {3},
 year = {2005},
 pages = {593-608}
}


@article{WOMJ,
 author = {H. Wi and S. Oh and J. Mun and M. Jung},
 title = {A team formation model based on knowledge and collaboration},
 journal = {Expert Syst. Appl.},
 volume = {36},
 number = {5},
 year = {2009},
 pages = {9121-9134}
}


@inproceedings{GSJ,
  
author    = {M. Gaston and J. Simmons and M. desJardins}, 
title     = {Adapting network structures for efficient team formation},
booktitle = {In Proceedings of the AAAI Fall Symposium on Artificial Multi-agent Learning},

year      = {2004}
}

@book{L,
author = {E. Lawler},
title = {Combinatorial optimization - networks and matroids},
publisher = {Holt, Rinehart, and Winston},
year = {1976}
}

@article{AHI,
 author = {Y. Asahiro and R. Hassin and K. Iwama},
 title = {Complexity of finding dense subgraphs},
 journal = {Discrete Appl. Math.},
 volume = {121},
 number = {1-3},
 year = {2002},
 pages = {15-26}
}

@article{FKP,
    author = {U. Feige and G. Kortsarz and D. Peleg},
    title = {The Dense k-Subgraph Problem},
    journal = {Algorithmica},
    year = {1999},
    volume = {29}
}

@article{K,
 author = {Subhash Khot},
 title = {Ruling Out PTAS for Graph Min-Bisection, Dense k-Subgraph, and Bipartite Clique},
 journal = {SIAM J Computing},
 volume = {36},
 number = {4},
 year = {2006},
 pages = {1025-1071}
}

@inproceedings{AC,
 author = {Reid Andersen and Kumar Chellapilla},
 title = {Finding Dense Subgraphs with Size Bounds},
 booktitle = {WAW '09: Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph},
 year = {2009},
 pages = {25-37}
}

@article{KW,
 author = {Michael Kuhn and Roger Wattenhofer},
 title = {The theoretic center of computer science},
 journal = {SIGACT News},
 volume = {38},
 number = {4},
 year = {2007},
 pages = {54-63}
 }



















 

 


